REES MATRIX COVERS FOR A CLASS OF SEMIGROUPS WITH LOCALLY COMMUTING IDEMPOTENTS

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Strongly locally testable semigroups with commuting idempotents and related languages

If we consider words over the alphabet which is the set of all elements of a semigroup S, then such a word determines an element of S: the product of the letters of the word. S is strongly locally testable if whenever two words over the alphabet S have the same factors of a fixed length k, then the products of the letters of these words are equal. We had previously proved [19] that the syntacti...

متن کامل

Rees Matrix Covers and Semidirect Products of Regular Semigroups

In a recent paper, P.G. Trotter and the author introduced a \regular" semidirect product UV of e-varieties U and V. Among several speciic situations investigated there was the case V = RZ, the e-variety of right zero semigroups. Applying a covering theorem of McAlister, it was shown there that in several important cases (for instance for the e-variety of inverse semigroups), U RZ is precisely t...

متن کامل

Function spaces of Rees matrix semigroups

We characterize function spaces of Rees matrixsemigroups. Then we study these spaces by using the topologicaltensor product technique.

متن کامل

Automatic Rees Matrix Semigroups

We consider the preservation of the properties of automaticity and prefix-automaticity in Rees matrix semigroups over semigroupoids and small categories. Some of our results are new or improve upon existing results in the single-object case of Rees matrix semigroups over semigroups.

متن کامل

Finite Aperiodic Semigroups with Commuting Idempotents and Generalizations

Among the most important and intensively studied classes of semigroups are finite semigroups, regular semigroups and inverse semigroups. Finite semigroups arise as syntactic semigroups of regular languages and as transition semigroups of finite automata. This connection has lead to a large and deep literature on classifying regular languages by means of algebraic properties of their correspondi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Proceedings of the Edinburgh Mathematical Society

سال: 2001

ISSN: 0013-0915,1464-3839

DOI: 10.1017/s0013091599001066